Research on Signature Verification Method Based on Discrete Fréchet Distance
نویسندگان
چکیده
منابع مشابه
A Middle Curve Based on Discrete Fréchet Distance
Given a set of polygonal curves we seek to find a “middle curve” that represents the set of curves. We ask that the middle curve consists of points of the input curves and that it minimizes the discrete Fréchet distance to the input curves. We develop algorithms for three different variants of this problem.
متن کاملApproximability of the Discrete Fréchet Distance
The Fréchet distance is a popular and widespread distance measure for point sequences and for curves. About two years ago, Agarwal et al [SIAM J. Comput. 2014] presented a new (mildly) subquadratic algorithm for the discrete version of the problem. This spawned a flurry of activity that has led to several new algorithms and lower bounds. In this paper, we study the approximability of the discre...
متن کاملDynamic Alignment Distance Based Online Signature Verification
A self-contained application that verifies the signatures of enrolled users is developed. The verifier uses dissimilarity values based on dynamic alignment distances. Three different threshold calculation techniques are investigated: The first one makes use of the information provided by forged signatures and the other two methods use the information gathered from genuine signatures. The method...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملOn Computing the Fréchet Distance Between Surfaces
We describe two (1 + ε)-approximation algorithms for computing the Fréchet distance between two homeomorphic piecewise linear surfaces R and S of genus zero and total complexity n, with Fréchet distance δ. 1. A 2 (( n+ Area(R)+Area(S) (εδ)2 )2) time algorithm if R and S are composed of fat triangles (triangles with angles larger than a constant). 2. An O(D/(εδ)2) · n + 2O(D/(εδ)) time algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2018
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/359/1/012003